Min-max Bias Robust Regression

نویسندگان

  • R. D. Martin
  • V. J. Yohai
  • R. H. Zamar
چکیده

This the problem maximum asymptotic bias of regression estimates over a-contamination for the joint of the response carriers. Two classes of estimates are treated: (1) Msestimates with bounded function p applied to the scaled residuals, using a very general class of scale estimates, and (2) Bounded influence function type generalized M-estimates. Estimates in the first class are oblta1rled as problem, while estimates in the second class are specified by an estimating equation. The first class of M-estimates is sufficiently general to include both Huber "Proposal 2" simultaneous estimates of regression coefficients and residuals scale, and Rousseeuw-Yohai "Sestimates" of regression [Robust and Nonlinear Time Series (1984): 256-272]. It is shown than an S-estimate based on a jump-function type p solves the min-max bias problem for the class of M-estimates with very general scale.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bias Robust Estimation of Scale Where Location Is Unknown

In this paper we consider the problem of robust estimation of the scale of the location residuals when the "true" underlying distribution of the data belongs to a contamination neighborhood of a parametric location-scale family. First we show that a scaled version of the l\tlADAM (median of absolute residuals about the median) is approximately most bias-robust within the class 0 Huber's proposa...

متن کامل

Is bias dispensable for fuzzy neural networks?

It is well known that a conventional feedforward neural network always has bias terms, which is necessary for it to solve classification or approximation problems. But for fuzzy neural networks (FNNs), it seems not quite clear yet whether the bias is dispensable or not. Some authors introduce the bias, while the others do not. This note tries to partly answer this question for two simple buildi...

متن کامل

Min-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty

We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...

متن کامل

The robust vertex centdian location problem with interval vertex weights on general graphs

In this paper, the robust vertex centdian  location  problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max  regret criterion. This problem  is  investigated  with objective function contains $lambda$  and  a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...

متن کامل

A robust approach based on conditional value-at-risk measure to statistical learning problems

Robust optimization is one of typical approaches to optimize a system with incomplete information and considerable uncertainty. The standard robust optimization problem minimizes maximum cost by focusing on the considerable worst case. In some application field, it is certainly important to consider the worst case among all considerable cases, but this min-max criterion tends to lead an overly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007